Scalable keyword search over relational data streams by aggressive candidate network consolidation
نویسندگان
چکیده
منابع مشابه
Toward Scalable Keyword Search over Relational Data
Keyword search (KWS) over relational databases has recently received significant attention. Many solutions and many prototypes have been developed. This task requires addressing many issues, including robustness, accuracy, reliability, and privacy. An emerging issue, however, appears to be performance related: current KWS systems have unpredictable running times. In particular, for certain quer...
متن کاملPath-based keyword search over XML streams
Recently, a great deal of attention has been focusing on processing keyword search over XML and XML streams. The keyword search is simple and provides a user-friendly way of retrieving required data from an XML data. Though its popularity, there is a concern over its efficiency. For this reason, several methods have been proposed to enable keyword search over XML streams. However, most of them ...
متن کاملTowards an Interactive Keyword Search over Relational
Keyword search over relational databases has been widely studied for the exploration of structured data in a userfriendly way. However, users typically have limited domain knowledge or are unable to precisely specify their search intention. Existing methods find the minimal units that contain all the query keywords, and largely ignore the interpretation of possible users’ search intentions. As ...
متن کاملScalable Continual Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying database schemas. Most of existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term in...
متن کاملScalable Keyword Search on Big RDF Data
Keyword search is a useful tool for exploring large RDF datasets. Existing techniques either rely on constructing a distance matrix for pruning the search space or building summarization from the RDF graphs for query processing. In this work, we show that existing techniques have serious limitations in dealing with realistic, large RDF graphs with tens of millions of triples. Furthermore, the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Systems
سال: 2019
ISSN: 0306-4379
DOI: 10.1016/j.is.2018.12.004